A Non-Incremental Hierarchical Conference Organization Using Shortest Distance Terminal
نویسندگان
چکیده
منابع مشابه
Hierarchical Self-Organization of Non-Cooperating Individuals
Hierarchy is one of the most conspicuous features of numerous natural, technological and social systems. The underlying structures are typically complex and their most relevant organizational principle is the ordering of the ties among the units they are made of according to a network displaying hierarchical features. In spite of the abundant presence of hierarchy no quantitative theoretical in...
متن کاملMulti - Terminal Shortest Paths
The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, we use a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log [n-l] special matrix mult...
متن کاملIncremental Volume Rendering Using Hierarchical Compression
We present a new algorithm here for efficient incremental rendering of volumetric datasets. The primary goal of this algorithm is to give average workstations the ability to efficiently render volume data received over relatively low bandwidth network links in such a way that rapid user feedback is maintained. Common limitations of workstation rendering of volume data include: large memory over...
متن کاملConference Organization
Advisory Committee Insup Lee, University of Pennsylvania, Philadelphia, USA Jane Liu, Academia Sinica, Taiwan Seung-Kyu Park, Ajou University, Korea Heonshik Shin, Seoul National University, Korea Kang G. Shin, University of Michigan, Ann Arbor, USA Aloysius K. Mok, University of Texas, Austin, USA Kenji Toda, Advanced Industrial Science and Technology, Japan Hideyuki Tokuda, Keio University, J...
متن کاملIncremental network design with shortest paths
We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, we show that the simplest variant is NP-hard, we analyze the worst-case performance of natural greedy heuristics, and we de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of IKEEE
سال: 2014
ISSN: 1226-7244
DOI: 10.7471/ikeee.2014.18.2.248